Globally convergent algorithms for dc operating point analysis of nonlinear circuits

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Globally convergent algorithms for DC operating point analysis of nonlinear circuits

An important objective in the analysis of an electronic circuit is to find its quiescent or dc operating point. This is the starting point for performing other types of circuit analysis. The most common method for finding the dc operating point of a nonlinear electronic circuit is the Newton–Raphson method (NR), a gradient search technique. There are known convergence issues with this method. N...

متن کامل

Evolutionary Computing for Operating Point Analysis of Nonlinear Circuits

The DC operating point of an electronic circuit is conventionally found using the NewtonRaphson method. This method is not globally convergent and can only find one solution of the circuit at a time. In this paper, evolutionary computing methods, including Genetic Algorithms, Evolutionary Programming, Evolutionary Strategies and Differential Evolution are explored as possible alternatives to Ne...

متن کامل

Threading Homotopies and DC Operating Points of Nonlinear Circuits

This paper studies continuation methods for nding isolated zeros of nonlinear functions.

متن کامل

Globally convergent DC trust-region methods

In this paper, we investigate the use of DC (Difference of Convex functions) models and algorithms in the solution of nonlinear optimization problems by trust-region methods. We consider DC local models for the quadratic model of the objective function used to compute the trust-region step, and apply a primal-dual subgradient method to the solution of the corresponding trust-region subproblems....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Evolutionary Computation

سال: 2003

ISSN: 1089-778X

DOI: 10.1109/tevc.2002.804319